COMPLETE SETS AND THE POLYNOMIAL-TIME HIERARCHY.WRATHALL C.1976; THEOR. COMPUTER SCI.; NETH.; DA. 1976 PARU 1977; VOL. 3; NO 1; PP. 23-33; BIBL. 13 REF.Article

CHARACTERIZATIONS OF THE DYCK SETS.WRATHALL C.1977; R.A.I.R.O., INFORMAT. THEOR.; FR.; DA. 1977; VOL. 11; NO 1; PP. 53-62; ABS. FR.; BIBL. 15 REF.Article

Trace monoids with some invertible generators : two decision problemsWRATHALL, C.Discrete applied mathematics. 1991, Vol 32, Num 2, pp 211-222, issn 0166-218XArticle

The word problem for free partially commutative groupsWRATHALL, C.Journal of symbolic computation. 1988, Vol 6, Num 1, pp 99-104, issn 0747-7171Article

BOUNDED QUERY MACHINES: ON NP ( ) AND NPQUERY ( )BOOK V; WRATHALL C.1981; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1981; VOL. 5; NO 1; PP. 41-50; BIBL. 15 REF.Article

A NOTE ON REPRESENTATIONS OF A CERTAIN MONOIDSQUIER C; WRATHALL C.1982; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1982; VOL. 17; NO 2; PP. 229-231; BIBL. 3 REF.Article

ON LANGUAGES SPECIFIED BY RELATIVE ACCEPTANCEBOOK RV; WRATHALL C.1978; THEOR. COMPUTER SCI.; NLD; DA. 1978; VOL. 7; NO 2; PP. 185-195; BIBL. 25 REF.Article

STACK LANGUAGES AND LOG N SPACEKING KN; WRATHALL C.1978; J. COMPUTER SYST. SCI.; USA; DA. 1978; VOL. 17; NO 3; PP. 281-299; BIBL. 20 REF.Article

A NOTE ON COMPLETE SETS AND TRANSITIVE CLOSUREBOOK RV; WRATHALL C.1982; MATHEMATICAL SYSTEMS THEORY; ISSN 0025-5661; DEU; DA. 1982; VOL. 15; NO 4; PP. 311-313; BIBL. 7 REF.Article

A NOTE ON CLASSES OF COMPLEMENTS AND THE LBA PROBLEMWOTSCHKE D; WRATHALL C.1978; ACTA INFORMAT.; DEU; DA. 1978; VOL. 10; NO 2; PP. 169-173; BIBL. 8 REF.Article

MONADIC THUE SYSTEMSBOOK RV; JANTZEN M; WRATHALL C et al.1982; THEOR. COMPUT. SCI.; ISSN 0304-3975; NLD; DA. 1982; VOL. 19; NO 3; PP. 231-251; BIBL. 23 REF.Article

COMPARISONS AND RESET MACHINES.BOOK RV; GREIBACH SA; WRATHALL C et al.1978; LECTURE NOTES COMPUTER SCI.; GERM.; DA. 1978; NO 62; PP. 113-124; BIBL. 11 REF.; (AUTOM. LANG. PROGRAM. COLLOQ. 5; UDINE; 1978)Conference Paper

ERASING STRINGSBOOK R; JANTZEN M; WRATHALL C et al.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; VOL. 104; PP. 252-260; BIBL. 15 REF.Conference Paper

RESET MACHINESBOOK RV; GREIBACH SA; WRATHALL C et al.1979; J. COMPUTER SYST. SCI.; USA; DA. 1979; VOL. 19; NO 3; PP. 256-276; BIBL. 17 REF.Article

A note on thuc systems with a single defining relationOTTO, F; WRATHALL, C.Mathematical systems theory. 1985, Vol 18, Num 2, pp 135-143, issn 0025-5661Article

Single-tape reset machinesGREIBACH, S. A; WRATHALL, C.R.A.I.R.O. Informatique théorique. 1986, Vol 20, Num 1, pp 55-77, issn 0399-0540Article

ON THE COMPLEXITY OF WORD PROBLEMS IN CERTAIN THUE SYSTEMS (PRELIMINARY REPORT)BOOK R; JANTZEN M; MONIEN B et al.1981; LECT. NOTES COMPUT. SCI.; ISSN 0302-9743; DEU; DA. 1981; NO 118; PP. 216-223; BIBL. 9 REF.Conference Paper

REDUCIBILITY AMONG FLOATING-POINT GRAPHSJOHNSON DB; MILLER W; MINNIHAN B et al.1979; J. ASS. COMPUTG MACHIN.; USA; DA. 1979; VOL. 26; NO 4; PP. 739-760; BIBL. 13 REF.Article

INCLUSION COMPLETE TALLY LANGUAGES AND THE HARTMANIS-BERMAN CONJECTUREBOOK RV; WRATHALL C; SELMAN AL et al.1977; MATH. SYST. THEORY; USA; DA. 1977; VOL. 11; NO 1; PP. 1-8; BIBL. 13 REF.Article

Overlaps in free partially commutative monoidsOTTO, F; WRATHALL, C.Journal of computer and system sciences (Print). 1991, Vol 42, Num 2, pp 186-198, issn 0022-0000, 13 p.Article

Single-tape reset machinesGREIBACH, S. A; WRATHALL, C.R.A.I.R.O. Informatique théorique. 1986, Vol 20, Num 1, pp 55-77, issn 0399-0540Article